منابع مشابه
Finite Automata Theory in
We describe here a development in the system Coq of a piece of Finite Automata Theory. The main result is the Kleene's theorem, expressing that regular expressions and nite automata deene the same languages. From a constructive proof of this result, we automatically obtain a functional program that compiles any regular expression into a nite automata, which constitutes the main part of the impl...
متن کاملApplications of Algebraic Automata Theory to Quantum Finite Automata
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognitio...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملTheory of finite automata with an introduction to formal languages
When there are many people who don't need to expect something more than the benefits to take, we will suggest you to have willing to reach all benefits. Be sure and surely do to take this theory of finite automata with an introduction to formal languages that gives the best reasons to read. When you really need to get the reason why, this theory of finite automata with an introduction to formal...
متن کاملon residually finite semigroups of cellullar automata
we prove that if $m$ is a monoid and $a$ a finite set with more than one element, then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
سال: 1962
ISSN: 1883-2172,0373-6385
DOI: 10.2206/kyushumfs.15.97